A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs
نویسندگان
چکیده
A simple and elegant formulation of compositional proof systems for concurrent programs results from a reenement of temporal logic semantics. The reened temporal language we propose is closed under w-stuttering and, thus, provides a fully abstract semantics with respect to some chosen observation level w. This avoids incorporating irrelevant detail in the temporal semantics of parallel programs. Besides compo-sitional veriication, concurrent program design and implementation of a coarser-grained program by a ner-grained one, turn out to be easily practicable in the setting of the new temporal logic.
منابع مشابه
On Using Temporal Logic for Refinement and Compositional Verification of Concurrent Systems
A simple and elegant formulation of compositional proof systems for concurrent programs results from a reenement of temporal logic semantics. The reened temporal language we propose is closed under w-stuttering and, thus, provides a fully abstract semantics with respect to some chosen observation level w. This avoids incorporating irrelevant detail in the temporal semantics of parallel programs...
متن کاملEvents in Linear-Time Properties
For over a decade, researchers in formal methods tried to create formalisms that permit natural specification of systems and allow mathematical reasoning about their correctness. The availability of fully-automated reasoning tools enables more non-specialists to use formal methods effectively — their responsibility reduces to just specifying the model and expressing the desired properties. Thus...
متن کاملFormal Reasoning about Actor Programs Using Temporal Logic
We here present an approach to reasoning about actor programs on the basis of temporal logic. Temporal logic is particularly appropriate for the speciication of concurrent programs, but most known temporal logic proof systems for concurrent computations rely on imperative language constructs, ignoring, e.g., the creation of processes and the dynamic connguration of communication channels, which...
متن کاملLogics and analyses for concurrent heap-manipulating programs
Reasoning about concurrent programs is difficult because of the need to consider all possible interactions between concurrently executing threads. The problem is especially acute for programs that manipulate shared heap-allocated data structures, since heapmanipulation provides more ways for threads to interact. Modular reasoning techniques sidestep this difficulty by considering every thread i...
متن کاملDecomposing Specifications of Concurrent Systems
Large systems are built from smaller parts. We present a method for deducing properties of a system by reasoning about its components. We show how to represent an individual component Πi by a formula Si so that the parallel composition usually denoted cobegin Π1 ‖ . . . ‖Πn coend is represented by the formula S1 ∧ . . . ∧ Sn. Composition is conjunction. We reduce composition to conjunction not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994